Tim Roughgarden - PDFSEARCH.IO - Document Search Engine

Tim Roughgarden
Results: 191

#	Item
101	X Do Externalities Degrade GSP’s Efficiency? Tim Roughgarden, Stanford ´ Tardos, Cornell Eva Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2012-06-21 14:07:51 Game theory Decision theory Mathematics Sponsored search auction Price of anarchy Auction theory Mechanism design Welfare economics Bayesian game Greedy algorithm Generalized second-price auction
102	Supply-Limiting Mechanisms TIM ROUGHGARDEN, Department of Computer Science, Stanford University INBAL TALGAM-COHEN, Department of Computer Science, Stanford University QIQI YAN, Department of Computer Science, Stanford U Add to Reading List Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com Language: English - Date: 2012-07-04 18:28:35 Mechanism design Game theory Auctions Auction theory Decision theory Gaming Prior-independent mechanism VickreyClarkeGroves auction VickreyClarkeGroves mechanism Auction Multiunit auction Normal distribution
103	Optimal Mechanism Design and Money Burning Jason D. Hartline∗ Tim Roughgarden† Electrical Engineering and Computer Science Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2008-03-17 23:29:32 Mechanism design Game theory Decision theory Gaming Mathematics Bayesian-optimal mechanism Virtual valuation Prior-free mechanism VickreyClarkeGroves mechanism Vickrey auction VickreyClarkeGroves auction Valuation
104	CS364B: Frontiers in Mechanism Design Lecture #12: Bayesian Incentive-Compatibility ∗ Tim Roughgarden† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-03-19 07:35:11 Game theory Mechanism design Auction theory Decision theory Gaming Auctions Revelation principle Revenue equivalence First-price sealed-bid auction Incentive compatibility Vickrey auction Nash equilibrium
105 $Mathematical optimization / Operations research / Numerical analysis / Mathematical analysis / Linear programming / Convex optimization / Combinatorial optimization / Feasible region / Duality / Linear regression / Candidate solution / Linear-fractional programming$	CS261: A Second Course in Algorithms Lecture #7: Linear Programming: Introduction and Applications∗ Tim Roughgarden† January 26, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-06 11:11:11 Mathematical optimization Operations research Numerical analysis Mathematical analysis Linear programming Convex optimization Combinatorial optimization Feasible region Duality Linear regression Candidate solution Linear-fractional programming
106	Prize in Game Theory and Computer Science of the Game Theory Society in Honour of Ehud Kalai The Prize was established in 2008 in recognition of Ehud Kalai’s role in promoting the connection of the two research areas b Add to Reading List Source URL: www.gametheorysociety.org Language: English - Date: 2016-08-04 07:02:49 Fellows of the Econometric Society Game theory Ehud Kalai Tim Roughgarden Yoav Shoham Kalai Price of anarchy Economics Academia Science
107	CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms∗ Tim Roughgarden† November 5, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-24 22:57:16 Computational complexity theory Theory of computation Operations research Complexity classes Combinatorial optimization Analysis of algorithms Knapsack problem Simplex algorithm Time complexity Optimization problem NP Polynomial-time approximation scheme
108	CS264: Beyond Worst-Case Analysis Lecture #2: Instance-Optimal Geometric Algorithms∗ Tim Roughgarden† September 24, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-10-03 12:51:27 Mathematics Applied mathematics Computer science Algorithms Mathematical logic Theoretical computer science Merge sort Combinatorial optimization Asymptotically optimal algorithm Elliptic curve primality
109	CS369N: Beyond Worst-Case Analysis Lecture #6: Pseudorandom Data and Universal Hashing∗ Tim Roughgarden† April 14, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-14 21:12:34 Information retrieval Information science Hashing Search algorithms Universal hashing Hash table Linear probing Hash function Leftover hash lemma Bloom filter Cryptographic hash function Probability distribution
110	CS168: The Modern Algorithmic Toolbox Lectures #11 and #12: Spectral Graph Theory Tim Roughgarden & Gregory Valiant∗ May 2, 2016 Spectral graph theory is the powerful and beautiful theory that arises from the following Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-06-04 09:49:43 Graph theory Mathematics Algebra Algebraic graph theory Matrix theory Matrices NP-complete problems Laplacian matrix Eigenvalues and eigenvectors Regular graph Spectral clustering Graph partition

UPDATE